Known plaintext attack on double random phase encoding using fingerprint as key and a method for avoiding the attack
نویسندگان
چکیده
منابع مشابه
A Known Plaintext Attack on Two-Key Triple Encryption
A chosen-plaintext attack on two-key triple encryption noted by Merkle and Hellman is extended to a known-plaintext attack. The known-plaintext attack has lower memory requirements than the chosen-plaintext attack, but has a greater running time. The new attack is a significant improvement over a known-plaintext brute-force attack, but is still not seen as a serious threat to two-key triple enc...
متن کاملKnown Plaintext Attack
In cryptography, the known plaintext attack, or KPA, is an attack based on having samples of both the plaintext and corresponding encrypted or ciphertext for that information available. This information is used to conduct an analysis of the data in order to determine the secret key used to encrypt and decrypt the information. Historical ciphers are very susceptible to the attack, while modern-d...
متن کاملA known plaintext attack on the ISAAC keystream generator
Stream ciphers are often used in applications where high speed and low delay are a requirement. The ISAAC keystream generator is a fast software-oriented encryption algorithm. In this papers the security of the ISAAC keystream generator is investigated. Cryptanalytic algorithm is developed for a known plaintext attack where only a small segment of plaintext is assumed to be known.
متن کاملA Known Plaintext Attack on the PKZIP Stream
Abs t r ac t . The PKZIP program is one of the more widely used archive/ compression programs on personM, computers. It also has many compatible variants on other computers~ and is used by most BBS's and ftp sites to compress their archives. PKZIP provides a stream cipher which allows users to scramble files with variable length keys (passwords). In this paper we describe a known pla.intext att...
متن کاملA Known Plaintext Attack on the PKZIP Stream Cipher
Table 3. Complexity of the attack by the size of the known plaintext and any other le which is encrypted by the same key. This known plaintext attack breaks the cipher using 40 (compressed) known plaintext bytes, or about the 200 rst uncompressed bytes (if the le is compressed), with complexity 2 34. Using about 10000 known plaintext bytes, the complexity is reduced to about 2 27. Table 3 descr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2010
ISSN: 1094-4087
DOI: 10.1364/oe.18.013772